A Low-Complexity Probabilistic Amplitude Shaping With Short Linear Block Codes

Trellis decoding complexity of linear block codes

AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds. Codes meeting these bounds minimize all ...

Low Complexity Wizard Amplitude Shaping (WAS) System for PAPR Reduction

Orthogonal Frequency Division Multiplexing (OFDM) is a method of encoding digital data on multiple carrier frequencies. OFDM has developed into a popular scheme for wide-band digital communication. Despite its advantages, it has a major drawback of its high Peak-to-Average Power Ratio (PAPR) value which degrades its efficiency and increases its cost. In this paper, two proposed systems are disc...

Space-time block codes with low maximum-likelihood decoding complexity

Low Complexity Linear Space-Time Codes

A new modulation method for linear space-time codes is proposed based on using constellations of different sizes for different symbols. The proposed method significantly reduces the complexity of the sphere decoding algorithm.

Reduced Complexity Maximum Likelihood Decoding of Linear Block Codes

This paper proposes a reduced complexity Maximum-Likelihood (ML) decoding Algorithm for Linear Block Codes based on the Kaneko decoder and incorporating ruling out conditions for useless iteration steps. The proposed decoding scheme is evaluated over the Additive White Gaussian Noise (AGWN) channel using Binary Phase Shift Key (BPSK) signalling by simulation. Simulations results show that for n...